Fair exchange protocols with anonymity and non-repudiation for payments
نویسندگان
چکیده
I declare that this assignment is all my own work and that I have acknowledged all quotations from the published or unpublished works of other people. I declare that I have also read the statements on plagiarism in Section 1 of the Regulations Governing Examination and Assessment Offences and in accordance with it I submit this project report as my own work. Abstract Our daily routine requires the establishment and control of a number of electronic transactions. In addition, the average global internet usage as well as the web activity per person has increased throughout the last few years and business today is reliant on open networks and systems that are always connected to support constant communication. As a result, IT is a critical component for all organisations and there is, often, no fall-back position in case of a failure. Network protocols are required to facilitate economic transactions and to usually protect the participants mutually in this process. Often, in this context, they are required to provide fairness, anonymity and non-repudiation. This thesis aims to illustrate the evolution of these protocols and point out situations where some existing protocol schemes have mismanaged their expected services or tried to provide them in a weaker sense. Additionally, we review the proposed formal methods for protocol analysis in order to identify their results as well as their limitations. The main goals of this dissertation, however, are the optimisation of the Netbill protocol in order to make it more secure and fairer as well as suggestions for its adaptation in the modern social networking and payment infrastructure.
منابع مشابه
Optimistic Protocols for Fair Exchange
We describe a generic protocol for fair exchange of electronic goods with non-repudiation. Goods can be signatures (i.e., non-repudiation tokens of public data), confidential data, or payments. The protocol does not involve a third party in the exchange in the faultless case but only for recovery.
متن کاملAn Extended Payment Model with Fair Non-Repudiation Protocols for M-Commerce
This paper proposes an extended mobile payment service model founded on the existing ones to solve the non-repudiation problems with fair non-repudiation protocols for all phases in a typical m-commerce transaction. The novel model bases on assumptions about the cooperation between mobile network operators and financial institutions to deal with different payment amounts ranging from micro to m...
متن کاملFEIPS: A Secure Fair-Exchange Payment System for Internet Transactions
In order to be considered secure, a payment system needs to address a number of security issues. Besides fundamental security requirements, like confidentiality, data integrity, authentication and non-repudiation, another important requirement for a secure payment system is fair exchange. Many existing payment protocols require that customers must pay for products before their delivery (in the ...
متن کاملP2P Overlay Network to Support E-commerce
P2P technology provides an excellent vehicle for the distribution of digital content at low cost to the content producer and distributor obviating the need for publishing middlemen. However, P2P content sharing networks are flawed with freeriding and copyright infringement. Providing financial incentives is one solution to overcome these problems; however the introduction of payments as a metho...
متن کاملGeneric non-repudiation protocols supporting transparent off-line TTP
A non-repudiation protocol enables the fair exchange of an electronic message and an irrefutable digital receipt between two mistrusting parties over the Internet. That is, at the end of any execution instance of such a protocol, either both parties obtain their expected items or neither party does. In this paper, we first argue that it is really meaningful in practice to exploit generic fair n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013